A nearly optimal correlation-independent readout of population activity
نویسندگان
چکیده
منابع مشابه
Linear readout from a neural population with partial correlation data
How much information does a neural population convey about a stimulus? Answers to this question are known to strongly depend on the correlation of response variability in neural populations. These noise correlations, however, are essentially immeasurable as the number of parameters in a noise correlation matrix grows quadratically with population size. Here, we suggest to bypass this problem by...
متن کاملNearly Optimal Private LASSO
We present a nearly optimal differentially private version of the well known LASSO estimator. Our algorithm provides privacy protection with respect to each training example. The excess risk of our algorithm, compared to the non-private version, is Õ(1/n), assuming all the input data has bounded `∞ norm. This is the first differentially private algorithm that achieves such a bound without the p...
متن کاملNearly Optimal Patchy Feedbacks
The paper is concerned with a general optimization problem for a nonlinear control system, in the presence of a running cost and a terminal cost, with free terminal time. We prove the existence of a patchy feedback whose trajectories are all nearly optimal solutions, with pre-assigned accuracy.
متن کاملNearly Optimal Private Convolution
We study algorithms for computing the convolution of a private input x with a public input h, while satisfying the guarantees of (ε, δ)-differential privacy. Convolution is a fundamental operation, intimately related to Fourier Transforms. In our setting, the private input may represent a time series of sensitive events or a histogram of a database of confidential personal information. Convolut...
متن کاملNearly optimal embedding of trees
In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be close to the minimum degree of G. For example, we prove that any graph of minimum degree d without 4-cycles contains every tree of size ǫd and maximum degree a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Neuroscience
سال: 2010
ISSN: 1662-453X
DOI: 10.3389/conf.fnins.2010.03.00257